منابع مشابه
Delaunay Triangulation for Curved Surfaces
Surface triangular meshing plays an important role in the areas of computer graphics and engineering analysis. Traditionally, surface meshing is achieved by mapping meshes created in 2D parametric space onto surfaces. Care is taken in generating meshes in the parametric space and mapping them to surfaces because the transformation of geometry from the parameter space to the real space could be ...
متن کاملDelaunay-restricted Optimal Triangulation of 3D Polygons
Triangulation of 3D polygons is a well studied topic of research. Existing methods for finding triangulations that minimize given metrics (e.g., sum of triangle areas or dihedral angles) run in a costly $O(n^4)$ time \cite{Barequet95,Barequet96}, while the triangulations are not guaranteed to be free of intersections. To address these limitations, we restrict our search to the space of triangle...
متن کاملConstrained Delaunay Triangulation Using Delaunay Visibility
An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...
متن کاملHexagonal Delaunay Triangulation
We present a novel and robust algorithm for triangulating point clouds in R. It is based on a highly adaptive hexagonal subdivision scheme of the input domain. That hexagon mesh has a dual triangular mesh with the following properties: • any angle of any triangle lies in the range between 43.9◦ and 90◦, • the aspect ratio of triangles is bound to 1.20787, • the triangulation has the Delaunay pr...
متن کاملRevisiting Optimal Delaunay Triangulation for 3D Graded Mesh Generation
This paper proposes a new algorithm to generate a graded three-dimensional tetrahedral mesh. It revisits the class of methods based on optimal Delaunay triangulation (ODT) and proposes a proper way of injecting a background density function into the objective function minimized by ODT. This continuous/analytic point of view leads to an objective function that is continuous and Delaunay consiste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 2018
ISSN: 0730-0301,1557-7368
DOI: 10.1145/3197517.3201358